Computing Maximal Copies of Polyhedra Contained in a Polyhedron
نویسندگان
چکیده
منابع مشابه
Computing Maximal Copies of Polyhedra Contained in a Polyhedron
Kepler (1619) and Croft (1980) have considered largest homothetic copies of one regular polytope contained in another regular polytope. For arbitrary pairs of polytopes we propose to model this as a quadratically constrained optimization problem. These problems can then be solved numerically; in case the optimal solutions are algebraic, exact optima can be recovered by solving systems of equati...
متن کاملA Ramsey Space of Infinite Polyhedra and the Random Polyhedron
In this paper we introduce a new topological Ramsey space P whose elements are infinite ordered polyhedra. The corresponding familiy AP of finite approximations can be viewed as a class of finite structures. It turns out that the closure of AP under isomorphisms is the class KP of finite ordered polyhedra. Following [8], we show that KP is a Ramsey class. Then, we prove a universal property for...
متن کاملComputing the Integer Points of a Polyhedron
Let K be a polyhedron in R, given by a system of m linear inequalities, with rational number coefficients bounded over in absolute value by L. We propose an algorithm for computing an irredundant representation of the integer points of K, in terms of “simpler” polyhedra, each of them having at least one integer point. Using the terminology of W. Pugh: for any such polyhedron P , no integer poin...
متن کاملA count of maximal small copies in Multibrot sets
We give a recursive formula to count maximal small copies of the Mandelbrot set and its higher degree analogues. This formula is used to compute the asymptotic growth of the number of maximal small copies of period n. Mathematics Subject Classification: 37F20
متن کاملLifting properties of maximal lattice-free polyhedra
We study the uniqueness of minimal liftings of cut-generating functions obtained from maximal lattice-free polyhedra. We prove a basic invariance property of unique minimal liftings for general maximal lattice-free polyhedra. This generalizes a previous result by Basu, Cornuéjols and Köppe [BCK12] for simplicial maximal lattice-free polytopes, thus completely settling this fundamental question ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Experimental Mathematics
سال: 2015
ISSN: 1058-6458,1944-950X
DOI: 10.1080/10586458.2014.956374